Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra

Abstract Verifying arithmetic circuits and most prominently multiplier is an important problem which in practice still considered to be challenging. One of the currently successful verification techniques relies on algebraic reasoning. In this article, we present AMulet2 , a fully automatic tool for integer multipliers combining SAT solving computer algebra. Our models given as and-inverter graphs set polynomials applies preprocessing based elimination theory Gröbner bases. Finally, it uses polynomial reduction algorithm verify correctness circuit. re-factorization improved re-implementation our previous AMulet1 cannot only used stand-alone but also serves reasoning framework. We novel XOR-based slicing approach discuss improvements data structures including monomial sharing.